Search results for "discrete [space-time]"

Upper bounds on multiparty communication complexity of shifts

1996

We consider some communication complexity problems which arise when proving lower bounds on the complexity of Boolean functions. In particular, we prove an \(O(\frac{n}{{2\sqrt {\log n} }}\log ^{1/4} n)\)upper bound on 3-party communication complexity of shifts, an O(n e ) upper bound on the multiparty communication complexity of shifts for a polylogarithmic number of parties. These bounds are all significant improvements over ones recently considered “unexpected” by Pudlak [5].

Some decisional problems on rational relations

1997

Abstract In this paper we prove that the problem of deciding whether a deterministic rational relation is star-free is recursively solvable, although the same problem for any rational relation is undecidable. We also prove that a rational relation is star-free if and only if it is aperiodic and deterministic.

Properties and constraints of cheating-immune secret sharing schemes

2006

AbstractA secret sharing scheme is a cryptographic protocol by means of which a dealer shares a secret among a set of participants in such a way that it can be subsequently reconstructed by certain qualified subsets. The setting we consider is the following: in a first phase, the dealer gives in a secure way a piece of information, called a share, to each participant. Then, participants belonging to a qualified subset send in a secure way their shares to a trusted party, referred to as a combiner, who computes the secret and sends it back to the participants.Cheating-immune secret sharing schemes are secret sharing schemes in the above setting where dishonest participants, during the recons…

An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems

1984

We propose new alternative theorems for convex infinite systems which constitute the generalization of the corresponding toGale, Farkas, Gordan andMotzkin. By means of these powerful results we establish new approaches to the Theory of Infinite Linear Inequality Systems, Perfect Duality, Semi-infinite Games and Optimality Theory for non-differentiable convex Semi-Infinite Programming Problem.

Optimization and Inversion

2009

Neural Network Based Finite-Time Stabilization for Discrete-Time Markov Jump Nonlinear Systems with Time Delays

2013

Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2013/359265 Open Access This paper deals with the finite-time stabilization problem for discrete-time Markov jump nonlinear systems with time delays and norm-bounded exogenous disturbance. The nonlinearities in different jump modes are parameterized by neural networks. Subsequently, a linear difference inclusion state space representation for a class of neural networks is established. Based on this, sufficient conditions are derived in terms of linear matrix inequalities to guarantee stochastic finite-time boundedness and stochastic finite-time stabi…

Distributed Consensus for Discrete-Time Directed Networks of Multiagents with Time-Delays and Random Communication Links

2013

Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2013/158731 Open Access This paper is concerned with the leader-following consensus problem in mean-square for a class of discrete-time multiagent systems. The multiagent systems under consideration are the directed and contain arbitrary discrete time-delays. The communication links are assumed to be time-varying and stochastic. It is also assumed that some agents in the network are well informed and act as leaders, and the others are followers. By introducing novel Lyapunov functionals and employing some new analytical techniques, sufficient conditi…

Exponential stability analysis of Markovian jump nonlinear systems with mixed time delays and partially known transition probabilities

2013

In this paper, the problem of exponential stability is studied for a class of Markovian jump neutral nonlinear systems with mixed neutral and discrete time delays. By Lyapunov-Krasovskii function approach, a novel mean-square exponential stability criterion is derived for the situation that the system's transition rates are partially or completely accessible. Finally, some numerical examples are provided to illustrate the effectiveness of the proposed methods.

Discrete Tomography Reconstruction Through a New Memetic Algorithm

2008

Discrete tomography is a particular case of computerized tomography that deals with the reconstruction of objects made of just one homogeneous material, where it is sometimes possible to reduce the number of projections to no more than four. Most methods for standard computerized tomography cannot be applied in the former case and ad hoc techniques must be developed to handle so few projections.

On Słowikowski, Raíkov and De Wilde Closed Graph Theorems

1986

Publisher Summary This chapter focuses on the Slowikowski, Raikov and De Wilde closed graph theorems. The vector spaces used in the chapter, are defined over the field Ղ of real or complex numbers. The term, “space” means separated topological vector space, unless the contrary is specifically stated. If Ω is a non-empty open subset of the n -dimensional euclidean space, then the Schwartz space ҟ′(Ω) endowed with the strong topology belongs to this class. The chapter also studies the classes of spaces related with this conjecture. The class of Slowikowski spaces contains the F-spaces and it is stable with respect to the operations that include: countable topological direct sums, closed subsp…